翻訳と辞書 Words near each other ・ Eight O'Clock Coffee ・ Eight O'Clock Walk ・ Eight of Cups ・ Eight of Santa Maria Novella ・ Eight of Swords ・ Eight of Wands ・ Eight Off ・ Eight on the Lam ・ Eight Ones ・ Eight or Nine Wise Words about Letter-Writing ・ Eight per thousand ・ Eight Pieces for Four Timpani ・ Eight principles ・ Eight Principles of Yong ・ Eight Provinces of Korea ・ Eight queens puzzle ・ Eight Ranger ・ Eight Ranger 2 ・ Eight Schools Association ・ Eight Second Ride ・ Eight Seconds ・ Eight Short Preludes and Fugues ・ Eight Sights of Guangzhou ・ Eight Skilled Gentlemen ・ Eight Skull ・ Eight Songs ・ Eight Songs for a Mad King ・ Eight Songs for Greg Sage and the Wipers ・ Eight stages of genocide ・ Eight Step Rail Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Eight queens puzzle ： ウィキペディア英語版 Eight queens puzzle The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal. The eight queens puzzle is an example of the more general ''n''-queens problem of placing ''n'' queens on an ''n''×''n'' chessboard, where solutions exist for all natural numbers ''n'' with the exception of ''n''=2 and ''n''=3.〔Hoffman, et al. "Construction for the Solutions of the m Queens Problem". Mathematics Magazine, Vol. XX (1969), p. 66–72. ()〕 ==History== Chess composer Max Bezzel published the eight queens puzzle in 1848. Franz Nauck published the first solutions in 1850.〔W. W. Rouse Ball (1960) ''The Eight Queens Problem'', in Mathematical Recreations and Essays, Macmillan, New York, pp 165-171.〕 Nauck also extended the puzzle to the ''n''-queens problem, with ''n'' queens on a chessboard of ''n'' × ''n'' squares. Since then, many mathematicians, including Carl Friedrich Gauss, have worked on both the eight queens puzzle and its generalized ''n''-queens version. In 1874, S. Gunther proposed a method using determinants to find solutions.〔 J.W.L. Glaisher refined Gunther's approach. In 1972 Edsger Dijkstra used this problem to illustrate the power of what he called structured programming. He published a highly detailed description of a depth-first backtracking algorithm.2 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Eight queens puzzle」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.